nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

in this study, the stochastic cell formation problem with developing model within queuing theory with stochastic demand, processing time and reliability has been presented. machine as server and part as customer are assumed where servers should service to customers. since, the cell formation problem is np-hard, therefore, deterministic methods need a long time to solve this model. in this study...

in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

cellular manufacturing system (cms) is highly important in modern manufacturing methods. given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. in this study, cms is considered in condition of dynamic demand in each period. the model is developed for facing dynamic demand that increases the cost of ...

this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...

In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...